|
|
Transportation theory in practice
Sojka, Jiří ; Dlouhá, Zuzana (advisor) ; Sokol, Ondřej (referee)
One of the most widely used optimization problems is vehicle routing problem. With minor adjustments of the limiting constraints it is usable on large variety of problems in fields of logistics or delivery of goods. The goal is to help company Víno Hruška s.r.o. to find a route for distribution of advertising materials to their own branches in the Czech Republic and Slovakia. First part is dedicated to theoretical introduction to methods of linear programming, second part is practical and uses described methods with real data. Routes found with heuristic methods and with optimization software are compared.
|
|
|
Optimization of Routes for Public Transport
Neumarová, Andrea ; Kučera, Petr (advisor) ; Fejfar, Jiří (referee)
This bachelor thesis, Optimization of Routes for Travel Agencies, deals mainly with traveling agency problem and its optimization for a specific travel agency. For the purposes of this research, the author has chosen routes from Václav Haver International Airport to several hotels from Prag area - Andel's Hotel Prague, Art Deco Imperial Hotel, EA Hotel Jasmín, Hotel Fortuna Rhea, InterContinental Prague, Orea Hotel Pyramida Praha, Panorama hotel Prague. The main object is to examine which of the selected tours are economically optimized (by costs).
The theoretical chapter is focused to the distribution tasks as well as methods, whose application leads to the optimization of the routes.
The practical chapter includes the modificated nearest neighbor method, and the Vogel approximation method. To illustrate the application of heuristic methods the calculation is carried out by savings method, too. In conclusion, the obtained results are evaluated and suggestions made for a more economic solutions of the routes examined
|
|
|
Computer service ‒ an aplication of traveling salesman problem
Ryglová, Michaela ; Skočdopolová, Veronika (advisor) ; Dvořák, Marek (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This thesis deals with the solution of traveling salesman problem to minimize distance in kilometres and focus on customer requirements, I am using data from firm CTR s.r.o. In addition to the basic model are also used mathematical model with modification tasks, so it is a model with hard time windows and a model with soft time windows. A practical solution is used in an optimization modeling language in Lingo software. The optimum solution was found for the model the traveling salesman and its modifications. The longest route 40.2 kilometers provides modification with a soft time windows, but gives the most emphasis on customer requirements. The shortest route 24 km is found with using a model the traveling salesman problem, but not considered any customer requirements.
|
|
|
Travelling around Vietnam-application of Travelling Salesman Problem
Pham, Thuy Trang ; Dlouhá, Zuzana (advisor) ; Fábry, Jan (referee)
The circular traffic problem, also known as the Travelling Salesman Problem (TSP) belongs to a group called distribution problems, which is one of the significant group of linear programming. These tasks can be used in many applications areas such as production planning, logistic or travelling. This thesis deals with the application of TSP or its modification to find the optimal route among selected Vietnamese destinations. The aim is to find the best circuit among 20 places out of 37 considering the cost and time. The first chapter concentrates on the general theory of linear programming including the description of economical and mathematical models of the selected distribution problems. The main part of this thesis focuses on The Travelling Salesman Problem itself and its practical application
|
|
|
Optimization of packages transport
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This bachelor thesis deals mainly with traveling salesman problem which belongs to the distribution problems and looking for its the best solution. The principle of the solutions of this problem is finding the shortest possible route that includes all of the prescribed addresses and returns to the initial location. Every location must be visited exactly once. There are numbers of modifications such as traveling salesman problem with time windows, courier service problem, dynamic traveling salesman problem and many others. We can solve these problems by using the systems to support modelling or using heuristic or metaheuristic methods. The thesis is divided into two parts, theoretical and practical. In the theoretical part the distribution problems are described, the traveling salesman problem in detail and selected algorithms of heuristic methods. The practical part is focused on the application of these methods which helps us to find the shortest possible route, which the PPL's employee would be able to manage during one day when he distributes packages. The solution is obtained by using an optimization system MPL for Windows, by application the nearest neighbour algorithm, the savings algorithm and the insert algorithm. In conclusion of the thesis all results are summarized and a mutual comparison of the calculation methods is performed.
|
|
|
Use of distribution of tasks in construction company
Repoň, Patrik ; Fábry, Jan (advisor) ; Skočdopolová, Veronika (referee)
Bachelor thesis deals with distribution of tasks, which have utility in the construction company. The aim is to apply these distribution of tasks to problems with which the construction company often meets, and to reach an acceptable solution that will help to streamline production, save working time or financial recourses. Bachelor thesis is divided into two parts. The first part is a theoretical part, which presents problems in construction companies in general, as well as the application of different types of distribution of tasks. Furthermore, we face mathematical models of these tasks and with description of optimization software LINGO, which we will use to resolve them. In the practical part the distribution of tasks are applied to concrete problems and real data. The final part contains an overall assessment of the results.
|
|
|
System for solving distribution problems of LP – LINGO/Excel interface
Krčál, Adam ; Jablonský, Josef (advisor) ; Zouharová, Martina (referee)
Discrete problems of linear programming, i. e. problems with integer or binary variables, have a great amount of real-life applications. Among distribution problems, belong many different kinds of problems with discrete character -- transportation problem, container transportation problem, allocation problem, assignment problem, plant location problem, traveling salesman problem etc. In this work the theoretical aspects of chosen types of problems are explained and then an application in Microsoft Excel 2010 environment is created. For that purpose programming language VBA is the key instrument. The application cooperates with two different optimization systems -- the Solver add-in in Excel and professional optimization system Lingo. Functionality of the application is thereafter tested on some examples.
|
|
|
The choir’s tour planning - an application of travelling salesman problem
Marešová, Iva ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
This thesis deals with planning a journey for a choir's tour by means of different methods of mathematical modelling. The first approach is the application of a travelling salesman problem. The study aims to find the shortest closed cycle which will give us an optimal solution. In the case which is solved in this thesis the model of the travelling salesman problem is partly modified because our goal is to choose only half of all the places which are the most effective for us. The thesis focuses on the application of those methods which give us only an approximate solution, particularly the method of the nearest neighbour and the method of change replacement. The first part of the thesis is devoted to the theory dealing with linear programming, distribution problems, heuristic methods and computer programmes for optimization. In the next part the discussed methods are applied to the concrete case in which the journey for the tour is planned. At the end of this thesis there are mentioned modifications which could be solved in this type of problems.
|
|
|
Optimalization of distribution process in trading company
Scigel, Pavel ; Jablonský, Josef (advisor) ; Kořenář, Václav (referee)
The thesis deals with distribution problems and their methods for their solution. They belong to one of the most often used optimization models in practice. The thesis describes background for using modelling support systems LINGO and MPL for Windows. The modelling languages allow solving all problems described in the theoretical part including the travelling salesman problem and the vehicle routing problem. There are described basic heuristic methods for problems with higher number of variables in this work as well. The thesis includes the description of a real situation for which it is possible to apply travelling salesman problem or vehicle routing problem models. It is a complex problem which cannot be solved by exact methods but heuristic methods must be used. The problem is going to be solved by means of MS Excel together with Visual Basic for Applications using the heuristic method of nearest neighbour.
|
|
|
Application of set-covering problem to fire district station Ovčáry
Ulrychová, Lenka ; Skočdopolová, Veronika (advisor) ; Kuncová, Martina (referee)
This thesis deals with the set-covering problem which belongs to distribution problems of the linear programming and in a practice can be found in many forms. The main goal of the standard set-covering problem is the construction of a new operating station which contains a degree of danger, but this thesis is focused on one operating station and examines the decision about its construction like a station of type JPO I, the problem contains so-called degrees of danger. Thesis is based on the real data provided by Fire Brigade of the Central region (Hasičský záchranný sbor Středočeského kraje). The theory of the distribution problems and optimization system MPL (which is the problem solved by) is presented in the first part. There a reader can also find a little information from the history of The Fire Brigade of the Czech Republic (HZS ČR). In the next part there is the description of modification for examining area coverage of the territory, where fire units are included instead of operating stations.
|
guest ::
